The Join Levels of the Trotter-Weil Hierarchy Are Decidable

نویسندگان

  • Manfred Kufleitner
  • Alexander Lauser
چکیده

The variety DA of finite monoids has a huge number of different characterizations, ranging from two-variable first-order logic FO to unambiguous polynomials. In order to study the structure of the subvarieties of DA, Trotter and Weil considered the intersection of varieties of finite monoids with bands, i.e., with idempotent monoids. The varieties of idempotent monoids are very well understood and fully classified. Trotter and Weil showed that for every band variety V there exists a unique maximal variety W inside DA such that the intersection with bands yields the given band variety V. These maximal varieties W define the Trotter-Weil hierarchy. This hierarchy is infinite and it exhausts DA; induced by band varieties, it naturally has a zigzag shape. Kufleitner and Weil have shown that it is possible to ascend the corners of the Trotter-Weil hierarchy in terms of Mal’cev products with definite and reverse definite semigroups and also in terms of so-called rankers. Using a result of Straubing, one can climb up the intersection levels of the Trotter-Weil hierarchy in terms of weakly iterated block products with J -trivial monoids. In their paper, Trotter and Weil have shown that the corners and the intersection levels of this hierarchy are decidable. In this paper, we give a single identity of omega-terms for every join level of the Trotter-Weil hierarchy; this yields decidability. Moreover, we show that the join levels and the subsequent intersection levels do not coincide. Almeida and Azevedo have shown that the join of R-trivial and L-trivial finite monoids is decidable; this is the first non-trivial join level of the Trotter-Weil hierarchy. We extend this result to the other join levels of the Trotter-Weil hierarchy. At the end of the paper, we give two applications. First, we show that the hierarchy of deterministic and codeterministic products is decidable. And second, we show that the direction alternation depth of unambiguous interval logic is decidable.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-locality of the meet levels of the Trotter-Weil Hierarchy

We prove that the meet level m of the Trotter-Weil hierarchy, Vm, is not local for all m ≥ 1, as conjectured in a paper by Kufleitner and Lauser. In order to show this, we explicitly provide a language whose syntactic semigroup is in LVm and not in Vm ∗ D.

متن کامل

The FO2 alternation hierarchy is decidable

We consider the two-variable fragment FO[<] of first-order logic over finite words. Numerous characterizations of this class are known. Thérien and Wilke have shown that it is decidable whether a given regular language is definable in FO[<]. From a practical point of view, as shown by Weis, FO[<] is interesting since its satisfiability problem is in NP. Restricting the number of quantifier alte...

متن کامل

The wreath product principle for ordered semigroups

Straubing’s wreath product principle provides a description of the languages recognized by the wreath product of two monoids. A similar principle for ordered semigroups is given in this paper. Applications to language theory extend standard results of the theory of varieties to positive varieties. They include a characterization of positive locally testable languages and syntactic descriptions ...

متن کامل

Some results on the dot-depth hierarchy

In this paper we pursue the study of the decidability of the dot-depth hierarchy. We give an effective lower bound for the dot-depth of an aperiodic monoid. The main tool for this is the study of a certain operation on varieties of finite monoids in terms of Mal’cev product. We also prove the equality of two decidable varieties which were known to contain all dot-depth two monoids. Finally, we ...

متن کامل

Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages

The purpose of this paper is to provide efficient algorithms that decide membership for classes of several Boolean hierarchies for which efficiency (or even decidability) were previously not known. We develop new forbidden-chain characterizations for the single levels of these hierarchies and obtain the following results: • The classes of the Boolean hierarchy over level Σ1 of the dot-depth hie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012